Interpolatory Refinement for Real-Time Processing of Point-Based Geometry
نویسندگان
چکیده
The point set is a flexible surface representation suitable for both geometry processing and real-time rendering. In most applications, the control of the point cloud density is crucial and being able to refine a set of points appears to be essential. In this paper, we present a new interpolatory refinement framework for point-based geometry. First we carefully select an appropriate one-ring neighborhood around the central interpolated point. Then new points are locally inserted where the density is too low using a √ 3-like refinement procedure and they are displaced on the corresponding curved Point Normal triangle. Thus, a smooth surface is reconstructed by combining the smoothing property produced by the rotational effect of √ 3-like refinements with the points/normal interpolation of PN triangles. In addition we show how to handle sharp features and how our algorithm naturally fills large holes in the geometry. Finally, we illustrate the robustness of our approach, its real-time capabilities and the smoothness of the reconstructed surface on a large set of input models, including irregular and sparse point clouds.
منابع مشابه
Dynamic surfel set refinement for high-quality rendering
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for large magnification, especially when the object is undersampled. This paper improves the rendering quality of pure splatting techniques using a fast dynamic up-sampling algorithm for point-based geometry. Our algorithm i...
متن کاملReal-Time Point Cloud Refinement
Splatting-based rendering techniques are currently the best choice for efficient high quality rendering of pointbased geometries. However, such techniques are not suitable for large magnification, especially when the object is under-sampled. This paper improves the rendering quality of pure splatting techniques using a fast dynamic up-sampling algorithm for point-based geometry. Our algorithm i...
متن کاملOn Convergent Interpolatory Subdivision Schemes in Riemannian Geometry
We show the convergence (for all input data) of refinement rules in Riemannian manifolds which are analogous to the linear four-point scheme and similar univariate interpolatory schemes, and which are generalized to the Riemannian setting by the so-called log/exp analogy. For this purpose we use a lemma on the Hölder regularity of limits of contractive refinement schemes in metric spaces. In co...
متن کاملAdaptive geometry compression based on 4-point interpolatory subdivision schemes with labels
We propose an adaptive geometry compression method with labels based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. Labels are recorded in...
متن کاملAdaptive Geometry Compression Based on 4-Point Interpolatory Subdivision Schemes
We propose an adaptive geometry compression method based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. In the meantime, we provide high-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 24 شماره
صفحات -
تاریخ انتشار 2005